Blar i NTNU Open på forfatter "Jo, Seungbum"

Viser treff 1-5 av 5

    • Approximate query processing over static sets and sliding windows 

      Basat, Ran Ben; Jo, Seungbum; Satti, Srinivasa Rao; Ugare, Shubham (Journal article; Peer reviewed, 2021)
      Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and ...

    • Encoding Two-Dimensional Range Top-k Queries 

      Jo, Seungbum; Lingala, Rahul; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2021)
      We consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering Top-k queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, ...

    • Succinct Data Structures for SP, Block-Cactus and 3 -Leaf Power Graphs 

      Chakraborty, Sankardeep; Jo, Seungbum; Sadakane, Kunihiko; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2023)
      We design succinct encodings of series-parallel, block-cactus and 3-leaf power graphs while supporting the basic navigational queries such as degree, adjacency and neighborhood optimally in the RAM model with logarithmic ...

    • Succinct Encodings for Families of Interval Graphs 

      Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2021)
      We consider the problem of designing succinct data structures for interval graphs with n vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time. Towards showing succinctness, ...

    • Succinct navigational oracles for families of intersection graphs on a circle 

      Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Nakashima, Kei; Sadakane, Kunihiko; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022)
      We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a ...